Flexible Triangle Search Algorithm for Block-Based Motion Estimation
نویسندگان
چکیده
منابع مشابه
Adaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملNormalized partial distortion search algorithm for block motion estimation
Many fast block-matching algorithms reduce computations by limiting the number of checking points. They can achieve high computation reduction, but often result in relatively higher matching error compared with the full-search algorithm. In this letter, a novel fast block-matching algorithm named normalized partial distortion search is proposed. The proposed algorithm reduces computations by us...
متن کاملEvolutionary strategy search algorithm for fast block motion estimation
The evolutionary strategy search (ESS) algorithm is a novel method for implementing fast block motion estimation (ME) using evolutionary strategy (ES). ESS uses a combination of ideas based on existing search strategies and employs a novel (1þ sl) ES implementation. It is essentially a succession of random searches, but by controlling the placement and distribution of these searches in a simple...
متن کاملAn adaptive search length algorithm for block matching motion estimation
This paper presents a new fast search algorithm for block matching motion estimation called the adaptive search length (ASL) algorithm. The ASL algorithm adaptively varies the number of positions searched for each block while still maintaining control of the average number of searches per block for each frame. Experimental results show that the peak signal-to-noise ratio (PSNR) of decoded seque...
متن کاملAn Efficient Search Algorithm for Block Motion Estimation
Many suboptimal motion vector search algorithms have been proposed because the full search algorithm, which is an optimal method, requires huge computational cost. Most of these algorithms find motion vectors simply from the center of the search window. In this paper, we propose an efficient motion vector search algorithm which, in order to predict the initial search point, exploits the global ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2006
ISSN: 1687-6180
DOI: 10.1155/2007/28782